<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>QJson: stack.hh Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">QJson
   &#160;<span id="projectnumber">1.0.0</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.8.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">stack.hh</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* A Bison parser, made by GNU Bison 2.3.  */</span>
<a name="l00002"></a>00002 
<a name="l00003"></a>00003 <span class="comment">/* Stack handling for Bison parsers in C++</span>
<a name="l00004"></a>00004 <span class="comment"></span>
<a name="l00005"></a>00005 <span class="comment">   Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.</span>
<a name="l00006"></a>00006 <span class="comment"></span>
<a name="l00007"></a>00007 <span class="comment">   This program is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment">   it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment">   the Free Software Foundation; either version 2, or (at your option)</span>
<a name="l00010"></a>00010 <span class="comment">   any later version.</span>
<a name="l00011"></a>00011 <span class="comment"></span>
<a name="l00012"></a>00012 <span class="comment">   This program is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment">   but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment">   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment">   GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"></span>
<a name="l00017"></a>00017 <span class="comment">   You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment">   along with this program; if not, write to the Free Software</span>
<a name="l00019"></a>00019 <span class="comment">   Foundation, Inc., 51 Franklin Street, Fifth Floor,</span>
<a name="l00020"></a>00020 <span class="comment">   Boston, MA 02110-1301, USA.  */</span>
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="comment">/* As a special exception, you may create a larger work that contains</span>
<a name="l00023"></a>00023 <span class="comment">   part or all of the Bison parser skeleton and distribute that work</span>
<a name="l00024"></a>00024 <span class="comment">   under terms of your choice, so long as that work isn&#39;t itself a</span>
<a name="l00025"></a>00025 <span class="comment">   parser generator using the skeleton or a modified version thereof</span>
<a name="l00026"></a>00026 <span class="comment">   as a parser skeleton.  Alternatively, if you modify or redistribute</span>
<a name="l00027"></a>00027 <span class="comment">   the parser skeleton itself, you may (at your option) remove this</span>
<a name="l00028"></a>00028 <span class="comment">   special exception, which will cause the skeleton and the resulting</span>
<a name="l00029"></a>00029 <span class="comment">   Bison output files to be licensed under the GNU General Public</span>
<a name="l00030"></a>00030 <span class="comment">   License without this special exception.</span>
<a name="l00031"></a>00031 <span class="comment"></span>
<a name="l00032"></a>00032 <span class="comment">   This special exception was added by the Free Software Foundation in</span>
<a name="l00033"></a>00033 <span class="comment">   version 2.2 of Bison.  */</span>
<a name="l00034"></a>00034 
<a name="l00035"></a>00035 <span class="preprocessor">#ifndef BISON_STACK_HH</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor"># define BISON_STACK_HH</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include &lt;deque&gt;</span>
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="keyword">namespace </span>yy
<a name="l00041"></a>00041 {
<a name="l00042"></a>00042   <span class="keyword">template</span> &lt;<span class="keyword">class</span> T, <span class="keyword">class</span> S = std::deque&lt;T&gt; &gt;
<a name="l00043"></a><a class="code" href="classyy_1_1stack.html">00043</a>   <span class="keyword">class </span><a class="code" href="classyy_1_1stack.html">stack</a>
<a name="l00044"></a>00044   {
<a name="l00045"></a>00045   <span class="keyword">public</span>:
<a name="l00046"></a>00046 
<a name="l00047"></a>00047     <span class="comment">// Hide our reversed order.</span>
<a name="l00048"></a>00048     <span class="keyword">typedef</span> <span class="keyword">typename</span> S::reverse_iterator iterator;
<a name="l00049"></a>00049     <span class="keyword">typedef</span> <span class="keyword">typename</span> S::const_reverse_iterator const_iterator;
<a name="l00050"></a>00050 
<a name="l00051"></a>00051     <a class="code" href="classyy_1_1stack.html">stack</a> () : seq_ ()
<a name="l00052"></a>00052     {
<a name="l00053"></a>00053     }
<a name="l00054"></a>00054 
<a name="l00055"></a>00055     <a class="code" href="classyy_1_1stack.html">stack</a> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n) : seq_ (n)
<a name="l00056"></a>00056     {
<a name="l00057"></a>00057     }
<a name="l00058"></a>00058 
<a name="l00059"></a>00059     <span class="keyword">inline</span>
<a name="l00060"></a>00060     T&amp;
<a name="l00061"></a>00061     operator [] (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)
<a name="l00062"></a>00062     {
<a name="l00063"></a>00063       <span class="keywordflow">return</span> seq_[i];
<a name="l00064"></a>00064     }
<a name="l00065"></a>00065 
<a name="l00066"></a>00066     <span class="keyword">inline</span>
<a name="l00067"></a>00067     <span class="keyword">const</span> T&amp;
<a name="l00068"></a>00068     operator [] (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00069"></a>00069 <span class="keyword">    </span>{
<a name="l00070"></a>00070       <span class="keywordflow">return</span> seq_[i];
<a name="l00071"></a>00071     }
<a name="l00072"></a>00072 
<a name="l00073"></a>00073     <span class="keyword">inline</span>
<a name="l00074"></a>00074     <span class="keywordtype">void</span>
<a name="l00075"></a>00075     push (<span class="keyword">const</span> T&amp; t)
<a name="l00076"></a>00076     {
<a name="l00077"></a>00077       seq_.push_front (t);
<a name="l00078"></a>00078     }
<a name="l00079"></a>00079 
<a name="l00080"></a>00080     <span class="keyword">inline</span>
<a name="l00081"></a>00081     <span class="keywordtype">void</span>
<a name="l00082"></a>00082     pop (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = 1)
<a name="l00083"></a>00083     {
<a name="l00084"></a>00084       <span class="keywordflow">for</span> (; n; --n)
<a name="l00085"></a>00085         seq_.pop_front ();
<a name="l00086"></a>00086     }
<a name="l00087"></a>00087 
<a name="l00088"></a>00088     <span class="keyword">inline</span>
<a name="l00089"></a>00089     <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00090"></a>00090     height ()<span class="keyword"> const</span>
<a name="l00091"></a>00091 <span class="keyword">    </span>{
<a name="l00092"></a>00092       <span class="keywordflow">return</span> seq_.size ();
<a name="l00093"></a>00093     }
<a name="l00094"></a>00094 
<a name="l00095"></a>00095     <span class="keyword">inline</span> const_iterator begin ()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> seq_.rbegin (); }
<a name="l00096"></a>00096     <span class="keyword">inline</span> const_iterator end ()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> seq_.rend (); }
<a name="l00097"></a>00097 
<a name="l00098"></a>00098   <span class="keyword">private</span>:
<a name="l00099"></a>00099 
<a name="l00100"></a>00100     S seq_;
<a name="l00101"></a>00101   };
<a name="l00102"></a>00102 
<a name="l00104"></a>00104   <span class="keyword">template</span> &lt;<span class="keyword">class</span> T, <span class="keyword">class</span> S = stack&lt;T&gt; &gt;
<a name="l00105"></a><a class="code" href="classyy_1_1slice.html">00105</a>   <span class="keyword">class </span><a class="code" href="classyy_1_1slice.html" title="Present a slice of the top of a stack.">slice</a>
<a name="l00106"></a>00106   {
<a name="l00107"></a>00107   <span class="keyword">public</span>:
<a name="l00108"></a>00108 
<a name="l00109"></a>00109     <a class="code" href="classyy_1_1slice.html" title="Present a slice of the top of a stack.">slice</a> (<span class="keyword">const</span> S&amp; <a class="code" href="classyy_1_1stack.html">stack</a>,
<a name="l00110"></a>00110            <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> range) : stack_ (stack),
<a name="l00111"></a>00111                                  range_ (range)
<a name="l00112"></a>00112     {
<a name="l00113"></a>00113     }
<a name="l00114"></a>00114 
<a name="l00115"></a>00115     <span class="keyword">inline</span>
<a name="l00116"></a>00116     <span class="keyword">const</span> T&amp;
<a name="l00117"></a>00117     operator [] (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00118"></a>00118 <span class="keyword">    </span>{
<a name="l00119"></a>00119       <span class="keywordflow">return</span> stack_[range_ - i];
<a name="l00120"></a>00120     }
<a name="l00121"></a>00121 
<a name="l00122"></a>00122   <span class="keyword">private</span>:
<a name="l00123"></a>00123 
<a name="l00124"></a>00124     <span class="keyword">const</span> S&amp; stack_;
<a name="l00125"></a>00125     <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> range_;
<a name="l00126"></a>00126   };
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128 
<a name="l00129"></a>00129 <span class="preprocessor">#endif // not BISON_STACK_HH</span>
</pre></div></div><!-- contents -->


<hr class="footer"/><address class="footer"><small>
Generated on Mon Apr 9 2012 23:57:46 for QJson by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.0
</small></address>

</body>
</html>
